On Waring?s problem for several algebraic forms

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Waring’s Problem for Several Algebraic Forms

We reconsider the classical problem of representing a finite number of forms of degree d in the polynomial ring over n + 1 variables as scalar combinations of powers of linear forms. We define a geometric construct called a ‘grove’, which, in a number of cases, allows us to determine the dimension of the space of forms which can be so represented for a fixed number of summands. We also present ...

متن کامل

On the Computation of Algebraic Modular Forms

In this paper, we revisit the theory of Brandt matrices for algebraic modular forms. We then apply this to the computation of Hilbert-Siegel modular forms of genus 2 over totally real number fields of narrow class number one. Some numerical examples of eigensystems of Hilbert-Siegel modular forms of genus 2 over Q( √ 2) are provided. Introduction Let G/Q be a connected reductive group such that...

متن کامل

Overconvergent Algebraic Automorphic Forms

I present a general theory of overconvergent p-adic automorphic forms and eigenvarieties for connected reductive algebraic groups G whose real points are compact modulo centre, extending earlier constructions for forms of GLn due to Buzzard, Chenevier and Yamagami. This leads to some new phenomena, including the appearance of intermediate spaces of “semiclassical” automorphic forms; this gives ...

متن کامل

Lattice methods for algebraic modular forms on classical groups

We use Kneser’s neighbor method and isometry testing for lattices due to Plesken and Souveigner to compute systems of Hecke eigenvalues associated to definite forms of classical reductive algebraic groups.

متن کامل

Asymptotic Forms and Algebraic Diierential Equations Asymptotic Forms and Algebraic Diierential Equations Asymptotic Forms and Algebraic Diierential Equations

We analyse the complexity of a simple algorithm for computing asymptotic solutions of an algebraic diierential equation. This analysis is based on a computation of the number of possible asymptotic monomials of a certain order, and on the study of the growth of this number as the order of the equation grows. Comportements asymptotiques et equations dii erentielles alg ebriques R esum e Nous ana...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Commentarii Mathematici Helvetici

سال: 2003

ISSN: 0010-2571,1420-8946

DOI: 10.1007/s00014-003-0769-6